A Comprehensive Study of the Efficiency of Type-Reduction Algorithms

Improving the efficiency of type-reduction algorithms continues to attract research interest. Recently, there has been some new approaches claiming that they are more efficient than well-known such as enhanced Karnik–Mendel (EKM) and iterative algorithm with stopping condition (EIASC). In a previous paper, we found computational an is closely related platform, how it implemented. computer science, dependence on languages usually avoided by focusing complexity (using big O notation). this article, main contribution proposal two novel algorithms. Also, for first time, comprehensive study both existing made based practical time under variety programming languages. Based results, suggestions given preferred in different scenarios depending implementation platform application context.